Convex extendable trees
نویسندگان
چکیده
The concept of convex extendability is introduced to answer the problem of nding the smallest distance convex simple graph containing a given tree. A problem of similar type with respect to minimal path convexity is also discussed. c © 1999 Elsevier Science B.V. All rights reserved
منابع مشابه
Explicit convex and concave envelopes through polyhedral subdivisions
5 In this paper, we derive explicit characterizations of convex and concave envelopes of several 6 nonlinear functions over various subsets of a hyper-rectangle. These envelopes are obtained 7 by identifying polyhedral subdivisions of the hyper-rectangle over which the envelopes can be 8 constructed easily. In particular, we use these techniques to derive, in closed-form, the concave 9 envelope...
متن کاملInteger Concave Cocirculations and Honeycombs
A convex triangular grid is a planar digraph G embedded in the plane so that each bounded face is an equilateral triangle with three edges and their union R forms a convex polygon. A function h : E(G) → R is called a concave cocirculation if h(e) = g(v) − g(u) for each edge e = (u, v), where g is a concave function on R which is affinely linear within each bounded face of G. Knutson and Tao obt...
متن کاملConvex Recolorings of Strings and Trees
A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree; a partial coloring (which assigns colors to some of the vertices) is convex if it can be completed to a convex (total) coloring. Convex coloring of trees arises in areas such as phylogenetics, linguistics, etc. eg, a perfect phylogenetic tree is one in which the states of each character induce a...
متن کاملOn the Local Profiles of Trees
We study the local profiles of trees. We show that in contrast with the situation for general graphs, the limit set of k-profiles of trees is convex. We initiate a study of the defining inequalities of this convex set. Many challenging problems remain open. C © 2015 Wiley Periodicals, Inc. J. Graph Theory 00: 1–11, 2015
متن کاملThe Stochastic Modelling of Trees
We present here a fast method for the modelling of trees which brings together two interesting techniques. The trees are modelled as convex polyhedra for the description of the gross. shape, and threedimensional texture mapping is used for the detailed features. The "essential" volume of the tree is represented as the convex intersection of half spaces. The advantage of this representation is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 206 شماره
صفحات -
تاریخ انتشار 1999